The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
نویسندگان
چکیده
A 2-edge-colored graph or a signed is simple with two types of edges. homomorphism from G to H mapping φ:V(G)→V(H) that maps every edge in an the same type H. Switching vertex v corresponds changing each incident v. There if after switching some subset vertices there The chromatic number (resp. signed) order smallest such class graphs maximum numbers class. We study and (connected not necessarily connected) given bounded degree. More precisely, we provide exact bounds for degree 2. then propose specific lower upper 3, 4, 5. finally general k, k.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملEdge-face chromatic number of plane graphs with high maximum degree
The edge-face chromatic number Xe / (G) of a plane graph G is the smallest number of colors assigned to the edges and faces of G so that any two adjacent or incident elements have different colors. Borodin(1994) proved that L1( G) ~ Xe/ (G) :::; L1( G) + 1 for each plane graph G with ~(G) ~ 10 and the bounds are sharp. The main result of this paper is to give a sufficient and necessary conditio...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملOn Chromatic Number of Colored Mixed Graphs
An (m,n)-colored mixed graph G is a graph with its arcs having one of the m different colors and edges having one of the n different colors. A homomorphism f of an (m,n)colored mixed graph G to an (m,n)-colored mixed graph H is a vertex mapping such that if uv is an arc (edge) of color c in G, then f(u)f(v) is an arc (edge) of color c in H . The (m,n)-colored mixed chromatic number χ(m,n)(G) of...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113579